Towards scalable fuzzy–rough feature selection
نویسندگان
چکیده
منابع مشابه
sCwc/sLcc: Highly Scalable Feature Selection Algorithms
Feature selection is a useful tool for identifying which features, or attributes, of a dataset cause or explain the phenomena that the dataset describes, and improving the efficiency and accuracy of learning algorithms for discovering such phenomena. Consequently, feature selection has been studied intensively in machine learning research. However, while feature selection algorithms that exhibi...
متن کاملScalable Greedy Feature Selection via Weak Submodularity
Greedy algorithms are widely used for problems in machine learning such as feature selection and set function optimization. Unfortunately, for large datasets, the running time of even greedy algorithms can be quite high. This is because for each greedy step we need to refit a model or calculate a function using the previously selected choices and the new candidate. Two algorithms that are faste...
متن کاملScalable Feature Selection Using Rough Set Theory
In this paper, we address the problem of feature subset selection using rough set theory. We propose a scalable algorithm to find a set of reducts based on discernibility function, which is an alternative solution for the exhaustive approach. Our study shows that our algorithm improves the classical one from three points of view: computation time, reducts size and the accuracy of induced model.
متن کاملSome Issues on Scalable Feature Selection
Feature selection determines relevant features in the data. It is often applied in pattern classiication, data mining, as well as machine learning. A special concern for feature selection nowadays is that the size of a database is normally very large, both vertically and horizontally. In addition, feature sets may grow as the data collection process continues. EEective solutions are needed to a...
متن کاملScalable Feature Selection for Large Sized Databases
Feature selection determines relevant features in the data. It is often applied in pattern classiica-tion. A special constraint for feature selection nowadays is that the size of a database is normally very large. An eeective method is needed to accommodate the practical demands. A scalable probabilistic algorithm is presented here as an alternative to the exhaustive and heuristics approaches. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Sciences
سال: 2015
ISSN: 0020-0255
DOI: 10.1016/j.ins.2015.06.025